Erdös-Rényi laws for dynamical systems
نویسندگان
چکیده
We establish Erdös-Rényi limit laws for Lipschitz observations on a class of non-uniformly expanding dynamical systems, including logistic-like maps. These limit laws give the maximal average of a time series over a time window of logarithmic length. We also give results on maximal averages of a time series arising from Hölder observations on intermittent-type maps over a time window of polynomial length. We consider the rate of convergence in the limit law for subshifts of finite type and establish a one-sided rate bound for Gibbs-Markov maps. AMS Classification: 37H10, 37A50, 37A05, 60F05, 60G10.
منابع مشابه
Annealed and Quenched Limit Theorems for Random Expanding Dynamical Systems
In this paper, we investigate annealed and quenched limit theorems for random expanding dynamical systems. Making use of functional analytic techniques and more probabilistic arguments with martingales, we prove annealed versions of a central limit theorem, a large deviation principle, a local limit theorem, and an almost sure central limit theorem. We also discuss the quenched central limit th...
متن کاملAnalysis of biological networks : Random Models ∗
1.1 Random (ER) graphs The Erdös-Rényi (ER) random graphs model, also called simply random graphs, was presented by Erdös and Rényi [4] in the 1950s and 1960s. Erdös and Rényi characterized random graphs and showed that many of the properties of such networks can be calculated analytically. Construction of an ER random graph with parameter 0 ≤ p ≤ 1 and N nodes is by connecting every pair of no...
متن کاملModelling Epidemics on Networks
Infectious disease remains, despite centuries of work to control and mitigate its effects, a major problem facing humanity. This paper reviews the mathematical modelling of infectious disease epidemics on networks, starting from the simplest Erdös-Rényi random graphs, and building up structure in the form of correlations, heterogeneity and preference, paying particular attention to the links be...
متن کاملErdös-Rényi Random Graphs: Warm Up
In this lecture we will introduce the Erdös-Rényi model of random graphs. Erdös and Rényi did not introduce them in an attempt to model any graphs found in the real world. Rather, they introduced them because they are the source of a lot of interesting mathematics. In fact, these random graphs have many properties that we do not know how to obtain through any efficient explicit construction of ...
متن کاملApproximate entropy of network parameters.
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. London Math. Society
دوره 87 شماره
صفحات -
تاریخ انتشار 2013